منابع مشابه
Simple Multi-Visit Attribute Grammars
An attribute grammar is simple multi-visit if each attribute of a nonterminal has a fixed visit-number associated with it such that, during attribute evaluation, the attributes of a node which have visit-number j are computed at the jth visit to the node. An attribute grammar is Iordered if for each nonterminal a linear order of its attributes exists such that the attributes of a node can alway...
متن کاملConditional Evaluation in Simple Multi-Visit Attribute-Grammar Evaluators
Attribute grammars are a formalism for specifying computations on context-free languages. Due to the nonstrictness of the if constructs in attribution equations, it is possible to avoid evaluating certain attribute instances in a syntax tree. A dynamic evaluator can easily avoid such useless computations with a demand-driven approach. However, dynamic evaluators are not efficient because they n...
متن کاملMulti-Plan Attribute Grammars
We identify a new class of non-circular attribute grammars, called the multi-plan attribute grammars, for which static evaluation plans can be computed. The class of multi-plan attribute grammars is larger than all currently known classes of non-circular attribute grammars with static evaluation plans. The decision procedure and the procedure for computing evaluation plans take essentially poly...
متن کاملAttribute Grammars
Attribute grammars are a framework for defining semantics of programming languages in a syntax-directed fashion. In this paper, we define attribute grammars, and then illustrate their use for language definition, compiler generation, definite clause grammars, design and specification of algorithms, etc. Our goal is to emphasize its role as a tool for design, formal specification and implementat...
متن کاملDynamic Attribute Grammars Dynamic Attribute Grammars Les Grammaires Attribuues Dynamiques
Although Attribute Grammars were introduced long ago, their lack of expressive-ness has resulted in limited use outside the domain of static language processing. With the new notion of Dynamic Attribute Grammars deened on top of Grammar Couples, informally presented in a previous paper, we show that it is possible to extend this expressiveness and to describe computations on structures that are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1982
ISSN: 0022-0000
DOI: 10.1016/0022-0000(82)90030-7